A Robust Path Metric for Mobile Wireless Networks

نویسندگان

  • Rainer Baumann
  • Simon Heimlicher
  • Vincent Lenders
  • Martin May
چکیده

In this paper, we propose and evaluate a path metric to select robust paths in mobile wireless networks. This path metric selects paths that offer a good trade-off between long routes consisting of many reliable links and short routes consisting of only few but unreliable links. In contrast to the widely used minimum hop count metric, which chooses arbitrarily among those paths with minimum length, our path metric estimates the reliability of a link based on the measured received signal strength (RSSI). Every node determines a preferred signal strength and assigns each neighbor a link cost depending on how close to this strength its RSSI value is. Using simulations with realistic mobility traces of a large city, we compare our path metric to the minimum hop count metric. With nodes moving at car speed, using our metric increases the average route lifetime by a factor of 7 and reduces the packet loss ratio due to route breaks during communication by a factor of up to 15.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

3D Path Planning Algorithm for Mobile Anchor-Assisted Positioning in Wireless Sensor Networks

Positioning service is one of Wireless Sensor Networks’ (WSNs) fundamental services. The accurate position of the sensor nodes plays a vital role in many applications of WSNs. In this paper, a 3D positioning algorithm is being proposed, using mobile anchor node to assist sensor nodes in order to estimate their positions in a 3D geospatial environment. However, mobile anchor node’s 3D path optim...

متن کامل

Improvement of the mechanism of congestion avoidance in mobile networks

Mobile ad hoc network congestion control is a significant problem. Standard mechanism for congestion control (TCP), the ability to run certain features of a wireless network, several mutations are not common. In particular, the enormous changes in the network topology and the joint nature of the wireless network. It also creates significant challenges in mobile ad hoc networks (MANET), density ...

متن کامل

A multiple criteria algorithm for planning the itinerary of mobile sink in wireless sensor networks

The mobile sink can increase the efficiency of wireless sensor networks. It moves in a monitored environment and collects the network nodes information. Thus, by the sink we can balance the power consumption and increases the network lifetime. Determining path of the sink's movement is usually modeled as an optimization problem where finding optimal solutions require collecting value of all the...

متن کامل

Dynamic Obstacle Avoidance by Distributed Algorithm based on Reinforcement Learning (RESEARCH NOTE)

In this paper we focus on the application of reinforcement learning to obstacle avoidance in dynamic Environments in wireless sensor networks. A distributed algorithm based on reinforcement learning is developed for sensor networks to guide mobile robot through the dynamic obstacles. The sensor network models the danger of the area under coverage as obstacles, and has the property of adoption o...

متن کامل

Representing a Model for Improving Connectivity and Power Dissipation in Wireless Networks Using Mobile Sensors

Wireless sensor networks are often located in areas where access to them is difficult or dangerous. Today, in wireless sensor networks, cluster-based routing protocols by dividing sensor nodes into distinct clusters and selecting local head-clusters to combine and send information of each cluster to the base station and balanced energy consumption by network nodes, get the best performance ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007